Least-squares inner product shaping
نویسنده
چکیده
We develop methods that construct an optimal set of vectors with a specified inner product structure, from a given set of vectors in a complex Hilbert space. The optimal vectors are chosen to minimize the sum of the squared norms of the errors between the constructed vectors and the given vectors. Four special cases are considered. In the first, the constructed vectors are orthonormal. In the second, they are orthogonal. In the third, the Gram matrix of inner products of the constructed vectors is a circulant matrix. As we show, the vectors form a cyclic set. In the fourth, the Gram matrix has the property that the rows are all permutations of each other. The constructed vectors are shown to be geometrically uniform. © 2002 Elsevier Science Inc. All rights reserved. AMS classification: 65F25; 15A04; 15A23; 15A99
منابع مشابه
Global least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملVectors — and an Application to Least Squares
This is also called the dot product and written X ·Y . The inner product of two vectors is a number, not another vector. In particular, we have the vital identity ‖X‖2 = 〈X , X〉 relating the inner product and norm. For added clarity, it is sometimes useful to write the inner product in Rn as 〈X , Y 〉Rn . Example: In R4 , if X = (1,2,−2,0) and Y = (−1,2,3,4) , then 〈X , Y 〉 = (1)(−1) + (2)(2)+(−...
متن کاملA least-squares approach based on a discrete minus one inner product for first order systems
The purpose of this paper is to develop and analyze a least-squares approximation to a first order system. The first order system represents a reformulation of a second order elliptic boundary value problem which may be indefinite and/or nonsymmetric. The approach taken here is novel in that the least-squares functional employed involves a discrete inner product which is related to the inner pr...
متن کاملLeast-squares Methods for Linear Elasticity Based on a Discrete minus One Inner Product
The purpose of this paper is to develop and analyze least-squares approximations for elasticity problems. The major advantage of the least-square formulation is that it does not require that the classical Ladyzhenskaya-Babǔska-Brezzi (LBB) condition be satisfied. By employing least-squares functionals which involve a discrete inner product which is related to the inner product in H−1(Ω) (the So...
متن کاملParallel Inner Product-Free Algorithm for Least Squares Problems
The performance of CGLS, a basic iterative method whose main idea is to organize the computation of conjugate gradient method applied to normal equations for solving least squares problems. On modern architecture is always limited because of the global communication required for inner products. Inner products often therefore present a bottleneck, and it is desirable to reduce or even eliminate ...
متن کامل